A Hierarchical Preconditioner for Wave Problems in Quasilinear Complexity

نویسندگان

چکیده

This paper introduces a novel, hierarchical preconditioner based on nested dissection and matrix compression. The is intended for continuous discontinuous Galerkin formulations of elliptic problems. We exploit the property that Schur complements arising in such problems can be well approximated by matrices. An approximate factorization computed matrix-free (quasi-)linear number operations. specifically designed to aid process using demonstrate viability range two-dimensional problems, including Helmholtz equation elastic wave equation. Throughout all tests, phenomena with high wavenumbers, generalized minimal residual method (GMRES) proposed converges very low iterations. theoretical cost verified numerical experiments, growth off-diagonal ranks studied both $h$- $p$-refinement.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A nonlinear preconditioner for experimental design problems

We address the slow convergence and poor stability of quasi-newton sequential quadratic programming (SQP) methods that is observed when solving experimental design problems, in particular when they are large. Our findings suggest that this behavior is due to the fact that these problems often have bad absolute condition numbers. To shed light onto the structure of the problem close to the solut...

متن کامل

A BDDC Preconditioner for Saddle Point Problems

The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...

متن کامل

A Preconditioner for Generalized Saddle Point Problems

In this paper we consider the solution of linear systems of saddle point type by preconditioned Krylov subspace methods. A preconditioning strategy based on the symmetric/ skew-symmetric splitting of the coefficient matrix is proposed, and some useful properties of the preconditioned matrix are established. The potential of this approach is illustrated by numerical experiments with matrices fro...

متن کامل

Quasilinear Time Complexity Theory

This paper furthers the study of quasi-linear time complexity initiated by Schnorr [Sch76] and Gurevich and Shelah [GS89]. We show that the fundamental properties of the polynomial-time hierarchy carry over to the quasilinear-time hierarchy. Whereas all previously known versions of the Valiant-Vazirani reduction from NP to parity run in quadratic time, we give a new construction using error-cor...

متن کامل

A Blocked Incomplete Cholesky Preconditioner for Hierarchical-memory Computers

We develop a drop-threshold incomplete Cholesky preconditioner which uses blocked data structures and computational kernels for improved performance on computers with one or more levels of cache memory. The techniques are similar to those used for Cholesky factorization in sparse direct solvers. We report on the performance of our preconditioned conjugate gradient solver on sparse linear system...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2022

ISSN: ['1095-7197', '1064-8275']

DOI: https://doi.org/10.1137/20m1365958